Fast Projected Area Computation for Three-Dimensional Bounding Boxes

نویسندگان

  • Dieter Schmalstieg
  • Robert F. Tobler
چکیده

The area covered by a three-dimensional bounding box after projection onto the screen is relevant for view-dependent algorithms in real-time and photorealistic rendering. We describe a fast method to compute the accurate two-dimensional area of a three-dimensional oriented bounding box, and show how it can be computed equally fast or faster than its approximation with a two-dimensional bounding box enclosing the projected three-dimensional bounding box.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Principal Components Dynamically

In this paper we present closed-form solutions for efficiently updating the prin-cipal components of a set of n points, when m points are added or deleted fromthe point set. For both operations performed on a discrete point set in R, we cancompute the new principal components in O(m) time for fixed d. This is a signifi-cant improvement over the commonly used approach of reco...

متن کامل

Evaluation of a fast method of EPID-based dosimetry for IMRT and Comparison with 3D EPID-based dosimetry system using conventional two- and three-dimensional detectors for VMAT

Introduction: Electronic portal imaging devices (EPIDs) could potentially be useful for intensity-modulated radiation therapy (IMRT) and VMAT QA. The data density, high resolution, large active area, and efficiency of the MV EPID make it an attractive option. However, EPIDs were designed as imaging devices, not dosimeters, and as a result they do not inherently measure dose in ...

متن کامل

Optimized bounding boxes for three-dimensional treatment planning in brachytherapy.

It is sometimes necessary to determine the optimal value for a direction dependent quantity. Using a search technique based on Powell's quadratic convergent method such an optimal direction can be approximated. The necessary geometric transformations in n-dimensional space are introduced. As an example we consider the approximation of the minimum bounding box of a set of three-dimensional point...

متن کامل

Hyperorthogonal Well-Folded Hilbert Curves

R-trees can be used to store and query sets of point data in two or more dimensions. An easy way to construct and maintain R-trees for two-dimensional points, due to Kamel and Faloutsos, is to keep the points in the order in which they appear along the Hilbert curve. The R-tree will then store bounding boxes of points along contiguous sections of the curve, and the efficiency of the R-tree depe...

متن کامل

Occlusion Evaluation in Hierarchical Radiosity

In any hierarchical radiosity method, the most expensive part is the evaluation of the visibility. Many methods use sampling and ray casting to determine this term. Space partitioning considerably speeds up the computation process. Partitioning with shafts, leads to a quite precise subdivision of 3D space, as far as interactions between pair of objects are concerned. The use of bounding boxes a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Graphics, GPU, & Game Tools

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1999